<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/tree_algorithms/binarytree/binarytree.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('binarytree_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">binarytree.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="binarytree_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * Copyright 2016- huaxz &lt;huaxz1986@163.com&gt;</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> * This program is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> * it under the terms of the GNU General Public License as published by</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> * the Free Software Foundation, either version 2 of the License, or</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * Author: huaxz1986@163.com (huaxz)</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#ifndef BINARYTREE</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#define BINARYTREE</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include&lt;memory&gt;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#include&lt;functional&gt;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespace_introduction_to_algorithm.html">IntroductionToAlgorithm</a></div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;{</div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="keyword">namespace </span>TreeAlgorithm</div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;{</div>
<div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;</div>
<div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html">   32</a></span>&#160;    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> NodeT&gt; <span class="keyword">struct </span><a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html">BinaryTree</a></div>
<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;    {</div>
<div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#a9a441f3f41c5b69758204ba60fe02010">   34</a></span>&#160;        <span class="keyword">typedef</span> NodeT <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#a9a441f3f41c5b69758204ba60fe02010">NodeType</a>; </div>
<div class="line"><a name="l00035"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#af231d881ec1d08492b2b5b5638e5e373">   35</a></span>&#160;        <span class="keyword">typedef</span> <span class="keyword">typename</span> NodeT::KeyType <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#af231d881ec1d08492b2b5b5638e5e373">KeyType</a>; </div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;</div>
<div class="line"><a name="l00041"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#adc9b1c18fd12ab56de09e92005848abf">   41</a></span>&#160;        <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#adc9b1c18fd12ab56de09e92005848abf">BinaryTree</a>():<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#aa0d43af70ef50ff59740dced2e832074">root</a>(std::shared_ptr&lt;NodeType&gt;())</div>
<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        {</div>
<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;        }</div>
<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;</div>
<div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#a96fa515f1c3b4176a03c37b8ea582339">   51</a></span>&#160;        std::string  <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#a96fa515f1c3b4176a03c37b8ea582339">to_xml</a>()</div>
<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;        {</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;            <span class="keywordflow">if</span>(<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#aa0d43af70ef50ff59740dced2e832074">root</a>)</div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;                <span class="keywordflow">return</span> <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#aa0d43af70ef50ff59740dced2e832074">root</a>-&gt;to_xml();</div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;            <span class="keywordflow">else</span></div>
<div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;                <span class="keywordflow">return</span> <span class="stringliteral">&quot;tree is empty!&quot;</span>;</div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;        }</div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;</div>
<div class="line"><a name="l00059"></a><span class="lineno"><a class="line" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#aa0d43af70ef50ff59740dced2e832074">   59</a></span>&#160;        std::shared_ptr&lt;NodeType&gt; <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#aa0d43af70ef50ff59740dced2e832074">root</a>; </div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;    };</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;</div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;</div>
<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> NodeType,<span class="keyword">typename</span> ActionType=std::function&lt;<span class="keywordtype">void</span> (<span class="keyword">typename</span> NodeType::T)&gt; &gt;</div>
<div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#abd9431ca8d1a40f70b6c72c732fc5892">   77</a></span>&#160;        <span class="keywordtype">void</span>  <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#abd9431ca8d1a40f70b6c72c732fc5892">inorder_walk</a>( std::shared_ptr&lt;NodeType&gt; root,ActionType action=[](<span class="keyword">typename</span> NodeType::T){})</div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;    {</div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;        <span class="keywordflow">if</span> (root)</div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        {</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;            <span class="keywordflow">if</span>(root-&gt;lchild) <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#abd9431ca8d1a40f70b6c72c732fc5892">inorder_walk</a>(root-&gt;lchild,action);</div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;            action(root-&gt;key);</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;            <span class="keywordflow">if</span>(root-&gt;rchild) <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#abd9431ca8d1a40f70b6c72c732fc5892">inorder_walk</a>(root-&gt;rchild,action);</div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;        }</div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;    }</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;</div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> NodeType,<span class="keyword">typename</span> ActionType=std::function&lt;<span class="keywordtype">void</span> (<span class="keyword">typename</span> NodeType::T)&gt; &gt;</div>
<div class="line"><a name="l00101"></a><span class="lineno"><a class="line" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a3d57267cd5fea456f6e001dc22d07c85">  101</a></span>&#160;        <span class="keywordtype">void</span>   <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a3d57267cd5fea456f6e001dc22d07c85">preorder_walk</a>( std::shared_ptr&lt;NodeType&gt; root,ActionType action=[](<span class="keyword">typename</span> NodeType::T){})</div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;    {</div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;        <span class="keywordflow">if</span> (root)</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        {</div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;            action(root-&gt;key);</div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;            <span class="keywordflow">if</span>(root-&gt;lchild) <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a3d57267cd5fea456f6e001dc22d07c85">preorder_walk</a>(root-&gt;lchild,action);</div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;            <span class="keywordflow">if</span>(root-&gt;rchild) <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a3d57267cd5fea456f6e001dc22d07c85">preorder_walk</a>(root-&gt;rchild,action);</div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;        }</div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;    }</div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;</div>
<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;</div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> NodeType,<span class="keyword">typename</span> ActionType=std::function&lt;<span class="keywordtype">void</span> (<span class="keyword">typename</span> NodeType::T)&gt; &gt;</div>
<div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a49b5467191bd51c25ad7e7bfbed51339">  127</a></span>&#160;        <span class="keywordtype">void</span>  <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a49b5467191bd51c25ad7e7bfbed51339">postorder_walk</a>( std::shared_ptr&lt;NodeType&gt; root,ActionType action=[](<span class="keyword">typename</span> NodeType::T){})</div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;    {</div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;        <span class="keywordflow">if</span> (root)</div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;        {</div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;            <span class="keywordflow">if</span>(root-&gt;lchild) <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a49b5467191bd51c25ad7e7bfbed51339">postorder_walk</a>(root-&gt;lchild,action);</div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;            <span class="keywordflow">if</span>(root-&gt;rchild) <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a49b5467191bd51c25ad7e7bfbed51339">postorder_walk</a>(root-&gt;rchild,action);</div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;            action(root-&gt;key);</div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;        }</div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;    }</div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;</div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;</div>
<div class="line"><a name="l00157"></a><span class="lineno"><a class="line" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a96be2938a006ec461c1b0a59d6bee3b5">  157</a></span>&#160;    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> NodeType&gt; <span class="keywordtype">void</span> <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a96be2938a006ec461c1b0a59d6bee3b5">left_rotate</a>(std::shared_ptr&lt;NodeType&gt; node,std::shared_ptr&lt;NodeType&gt;&amp; root)</div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;    {</div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;</div>
<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;        <span class="keywordflow">if</span> (node)  <span class="comment">//node非空</span></div>
<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;        {</div>
<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;            <span class="keyword">auto</span> right=node-&gt;rchild; <span class="comment">//r_node</span></div>
<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;            <span class="keywordflow">if</span>(right)  <span class="comment">//r_node非空</span></div>
<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;            {</div>
<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;                <span class="keyword">auto</span> l_right=right-&gt;lchild; <span class="comment">//l_r_node;</span></div>
<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;                right-&gt;parent=node-&gt;parent;       <span class="comment">//r_node提至node的原位置</span></div>
<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;                <span class="keyword">auto</span> shared_p=node-&gt;parent.lock(); <span class="comment">//node的父节点</span></div>
<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;                <span class="keywordflow">if</span>(shared_p)                      <span class="comment">//node的父节点修订</span></div>
<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;                {</div>
<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;                   <span class="keywordflow">if</span>(node-&gt;is_left_child()) shared_p-&gt;lchild=right;</div>
<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;                   <span class="keywordflow">if</span>(node-&gt;is_right_child()) shared_p-&gt;rchild=right;</div>
<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;                }<span class="keywordflow">else</span></div>
<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;                {</div>
<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;                    root=right;</div>
<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;                }</div>
<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;                node-&gt;rchild=l_right; <span class="comment">//r_node的左子节点剪切到 node的右侧</span></div>
<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                <span class="keywordflow">if</span>(l_right) l_right-&gt;parent=node;</div>
<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;</div>
<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;                node-&gt;parent=right;  <span class="comment">//node剪切到 r_node的左侧</span></div>
<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;                right-&gt;lchild=node;</div>
<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;               }</div>
<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;          }</div>
<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;    }</div>
<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;</div>
<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;</div>
<div class="line"><a name="l00204"></a><span class="lineno"><a class="line" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#adeb83a10f8daa65c5cf5921737a04da0">  204</a></span>&#160;     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> NodeType&gt; <span class="keywordtype">void</span>  <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#adeb83a10f8daa65c5cf5921737a04da0">right_rotate</a>(std::shared_ptr&lt;NodeType&gt; node,std::shared_ptr&lt;NodeType&gt;&amp; root)</div>
<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;     {</div>
<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;            <span class="keywordflow">if</span> (node)  <span class="comment">//node非空</span></div>
<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;            {</div>
<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;                <span class="keyword">auto</span> left=node-&gt;lchild;<span class="comment">//l_node非空</span></div>
<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;                <span class="keywordflow">if</span>(left)<span class="comment">//l_node非空</span></div>
<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;                {</div>
<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;                    <span class="keyword">auto</span> r_left=left-&gt;rchild; <span class="comment">//r_l_node</span></div>
<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;                    left-&gt;parent=node-&gt;parent;<span class="comment">//l_node提至node的原位置</span></div>
<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;                    <span class="keyword">auto</span> shared_p=node-&gt;parent.lock();</div>
<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;                    <span class="keywordflow">if</span>(shared_p)<span class="comment">//node的父节点修订</span></div>
<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;                    {</div>
<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;                        <span class="keywordflow">if</span>(node-&gt;is_right_child()) shared_p-&gt;rchild=left;</div>
<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;                        <span class="keywordflow">if</span>(node-&gt;is_left_child()) shared_p-&gt;lchild=left;</div>
<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;                    }<span class="keywordflow">else</span></div>
<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;                    {</div>
<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;                        root=left;</div>
<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;                    }</div>
<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;                    node-&gt;lchild=r_left; <span class="comment">//l_node的右子节点剪切到 node的左侧</span></div>
<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;                    <span class="keywordflow">if</span>(r_left) r_left-&gt;parent=node;</div>
<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;</div>
<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;                    node-&gt;parent=left;  <span class="comment">//node剪切到 l_node的右侧</span></div>
<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;                    left-&gt;rchild=node;</div>
<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;                }</div>
<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;    }</div>
<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;  }</div>
<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;</div>
<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;</div>
<div class="line"><a name="l00249"></a><span class="lineno"><a class="line" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a4fb6d9c7d8b75a8d6ec4ee79fc0b1de5">  249</a></span>&#160;    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> NodeType&gt; <span class="keywordtype">void</span>  <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a4fb6d9c7d8b75a8d6ec4ee79fc0b1de5">transplant</a>(std::shared_ptr&lt;NodeType&gt; node_src,std::shared_ptr&lt;NodeType&gt;node_dst,std::shared_ptr&lt;NodeType&gt;&amp; root)</div>
<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;     {</div>
<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;            <span class="keywordflow">if</span>(!node_dst)</div>
<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;            {</div>
<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;                <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;transparent() should not be aplied on dst:nullptr &quot;</span>);</div>
<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;            }</div>
<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;            <span class="keywordflow">if</span>(node_src) <span class="comment">//替换掉parent</span></div>
<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;            {</div>
<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;                node_src-&gt;parent=node_dst-&gt;parent;</div>
<div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;            }</div>
<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;            <span class="keyword">auto</span> shared_p=node_dst-&gt;parent.lock();</div>
<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;            <span class="keywordflow">if</span>(!shared_p) <span class="comment">//node_dst是根节点</span></div>
<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;            {</div>
<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;                root=node_src;</div>
<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;                <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;            }<span class="keywordflow">else</span> <span class="comment">//node_dst不是根节点</span></div>
<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;            {</div>
<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;                <span class="keywordflow">if</span>(node_dst-&gt;is_left_child()) <span class="comment">//node_dst是左子</span></div>
<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;                {</div>
<div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;                    shared_p-&gt;lchild=node_src;</div>
<div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;                }<span class="keywordflow">else</span>                         <span class="comment">//node_dst是右子</span></div>
<div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;                {</div>
<div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;                    shared_p-&gt;rchild=node_src;</div>
<div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;                }</div>
<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;            }</div>
<div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;      }</div>
<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;}</div>
<div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;}</div>
<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;<span class="preprocessor">#endif // BINARYTREE</span></div>
<div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;</div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_tree_algorithm_html_a49b5467191bd51c25ad7e7bfbed51339"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a49b5467191bd51c25ad7e7bfbed51339">IntroductionToAlgorithm::TreeAlgorithm::postorder_walk</a></div><div class="ttdeci">void postorder_walk(std::shared_ptr&lt; NodeType &gt; root, ActionType action=[](typename NodeType::T){})</div><div class="ttdoc">postorder_walk：二叉树的后序遍历 </div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00127">binarytree.h:127</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_tree_algorithm_html_a3d57267cd5fea456f6e001dc22d07c85"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a3d57267cd5fea456f6e001dc22d07c85">IntroductionToAlgorithm::TreeAlgorithm::preorder_walk</a></div><div class="ttdeci">void preorder_walk(std::shared_ptr&lt; NodeType &gt; root, ActionType action=[](typename NodeType::T){})</div><div class="ttdoc">preorder_walk：二叉树的前序遍历 </div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00101">binarytree.h:101</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTree</a></div><div class="ttdoc">BinaryTree：二叉树，算法导论10章10.4节 </div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00032">binarytree.h:32</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_html_af231d881ec1d08492b2b5b5638e5e373"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#af231d881ec1d08492b2b5b5638e5e373">IntroductionToAlgorithm::TreeAlgorithm::BinaryTree::KeyType</a></div><div class="ttdeci">NodeT::KeyType KeyType</div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00035">binarytree.h:35</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_html_adc9b1c18fd12ab56de09e92005848abf"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#adc9b1c18fd12ab56de09e92005848abf">IntroductionToAlgorithm::TreeAlgorithm::BinaryTree::BinaryTree</a></div><div class="ttdeci">BinaryTree()</div><div class="ttdoc">默认函数 </div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00041">binarytree.h:41</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_tree_algorithm_html_abd9431ca8d1a40f70b6c72c732fc5892"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#abd9431ca8d1a40f70b6c72c732fc5892">IntroductionToAlgorithm::TreeAlgorithm::inorder_walk</a></div><div class="ttdeci">void inorder_walk(std::shared_ptr&lt; NodeType &gt; root, ActionType action=[](typename NodeType::T){})</div><div class="ttdoc">inorder_walk：二叉树的中序遍历 </div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00077">binarytree.h:77</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_html_a96fa515f1c3b4176a03c37b8ea582339"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#a96fa515f1c3b4176a03c37b8ea582339">IntroductionToAlgorithm::TreeAlgorithm::BinaryTree::to_xml</a></div><div class="ttdeci">std::string to_xml()</div><div class="ttdoc">to_xml:返回本树的xml描述。 </div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00051">binarytree.h:51</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_tree_algorithm_html_a4fb6d9c7d8b75a8d6ec4ee79fc0b1de5"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a4fb6d9c7d8b75a8d6ec4ee79fc0b1de5">IntroductionToAlgorithm::TreeAlgorithm::transplant</a></div><div class="ttdeci">void transplant(std::shared_ptr&lt; NodeType &gt; node_src, std::shared_ptr&lt; NodeType &gt;node_dst, std::shared_ptr&lt; NodeType &gt; &amp;root)</div><div class="ttdoc">transplant：二叉树的剪切操作 </div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00249">binarytree.h:249</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_html_aa0d43af70ef50ff59740dced2e832074"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#aa0d43af70ef50ff59740dced2e832074">IntroductionToAlgorithm::TreeAlgorithm::BinaryTree::root</a></div><div class="ttdeci">std::shared_ptr&lt; NodeType &gt; root</div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00059">binarytree.h:59</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_html_a9a441f3f41c5b69758204ba60fe02010"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#a9a441f3f41c5b69758204ba60fe02010">IntroductionToAlgorithm::TreeAlgorithm::BinaryTree::NodeType</a></div><div class="ttdeci">NodeT NodeType</div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00034">binarytree.h:34</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_tree_algorithm_html_a96be2938a006ec461c1b0a59d6bee3b5"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a96be2938a006ec461c1b0a59d6bee3b5">IntroductionToAlgorithm::TreeAlgorithm::left_rotate</a></div><div class="ttdeci">void left_rotate(std::shared_ptr&lt; NodeType &gt; node, std::shared_ptr&lt; NodeType &gt; &amp;root)</div><div class="ttdoc">left_rotate：二叉树的左旋转操作 </div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00157">binarytree.h:157</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_tree_algorithm_html_adeb83a10f8daa65c5cf5921737a04da0"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#adeb83a10f8daa65c5cf5921737a04da0">IntroductionToAlgorithm::TreeAlgorithm::right_rotate</a></div><div class="ttdeci">void right_rotate(std::shared_ptr&lt; NodeType &gt; node, std::shared_ptr&lt; NodeType &gt; &amp;root)</div><div class="ttdoc">right_rotate：二叉树的右旋转操作 </div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00204">binarytree.h:204</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_html"><div class="ttname"><a href="namespace_introduction_to_algorithm.html">IntroductionToAlgorithm</a></div><div class="ttdoc">Namespace of IntrodunctionToAlgorithm. </div><div class="ttdef"><b>Definition:</b> <a href="longest__common__subsequence_8h_source.html#l00024">longest_common_subsequence.h:24</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_2a06141a7764b24a0bfc3200068bd811.html">tree_algorithms</a></li><li class="navelem"><a class="el" href="dir_fd969146925b6d16f48b118241ca662a.html">binarytree</a></li><li class="navelem"><a class="el" href="binarytree_8h.html">binarytree.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
